Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich

Source URL: www.tik.ee.ethz.ch

• Search algorithms
• Hashing
• Selection algorithm
• Hash function
• Randomized algorithm
• A* search algorithm
• Cryptographic hash function

Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011

Source URL: disco.ethz.ch

• Analysis of algorithms
• Balls into bins
• With high probability
• Randomized algorithm
• Time complexity
• Chernoff bound
• Maximal independent set
• EdmondsPruhs protocol

Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Competitive analysis
• Adversary model
• List update problem
• Metrical task system
• K-server problem
• Randomized algorithm
• Algorithm
• Page replacement algorithm
• Ski rental problem

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Theoretical computer science
• Metrical task system
• K-server problem
• Adversary model
• Algorithm
• Competitive analysis
• Randomized algorithm
• Approximation algorithm
• Computational learning theory

Microsoft PowerPoint - SPAA2007

Source URL: www.tik.ee.ethz.ch

• Analysis of algorithms
• Randomized algorithm
• Time complexity
• Algorithm
• Asymptotically optimal algorithm
• With high probability

The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing For reviewing purposes only. Please do not distribute! Aris Anagnostopoulos Luca Becchetti

Source URL: matteo.rionda.to

• Analysis of algorithms
• Algorithm
• FisherYates shuffle
• Crowdsourcing
• Randomized algorithm
• Time complexity
• Big O notation

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Source URL: people.mpi-inf.mpg.de

• Analysis of algorithms
• Balls into bins
• With high probability
• Sorting algorithm
• Leader election
• Time complexity
• Best
• worst and average case
• Big O notation
• Bin
• Iterated logarithm
• Randomized algorithm
• Asymptotically optimal algorithm

Randomized Algorithms for Solving Large Scale Nonlinear Least Squares Problems by Farbod Roosta-Khorasani

Source URL: www.stat.berkeley.edu

• Probabilistic complexity theory
• Numerical analysis
• Analysis of algorithms
• Algorithm
• Mathematical logic
• Theoretical computer science
• Monte Carlo method
• Pi
• Stochastic
• Randomized algorithm

CS261: A Second Course in Algorithms Lecture #11: Online Learning and the Multiplicative Weights Algorithm∗ Tim Roughgarden† February 9, 2016

Source URL: theory.stanford.edu

• Markov models
• Decision theory
• Search algorithms
• Probabilistic complexity theory
• Belief revision
• Reinforcement learning
• Minimax
• Randomized algorithm

Randomized Algorithms for Fast Bayesian Hierarchical Clustering Katherine A. Heller and Zoubin Ghahramani Gatsby Computational Neuroscience Unit University College London, London, WC1N 3AR, UK {heller,zoubin}@gatsby.ucl.

Source URL: mlg.eng.cam.ac.uk